#pragma GCC optimize(2, "Ofast", "inline")
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <algorithm>
#define endl '\n'
#define int long long
#define pii pair<int, int>
using namespace std;

// 已1
vector<int> a(4);

// 未知
string s = "+-*/";

bool check(vector<int> ops) 
{
    vector<int> nums = { a[0], a[1], a[2], a[3] };
    // 第一阶段：处理所有乘除法
    for (int i = 0; i < ops.size(); )
    {
        if (ops[i] > 1)
        {
            int a = nums[i];
            int b = nums[i + 1];
            if (ops[i] == 2)  nums[i] = a * b;
            else if (right == 0 || a % b != 0) return false;
            else nums[i] = a / b;
            nums.erase(nums.begin() + i + 1);
            ops.erase(ops.begin() + i);
        }
        else
        {
            i++;
        }
    }
    // 第二阶段：处理加减法
    int ans = nums[0];
    for (int i = 0; i < ops.size(); i++)
    {
        if (ops[i] == 0)  ans += nums[i + 1];
        else ans -= nums[i + 1];
    }
    return ans == 24;
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> a[0] >> a[1] >> a[2] >> a[3];
    sort(a.begin(), a.end());
    do
    {
        for (int i = 0;i < 4;++i)
        {
            for (int j = 0;j < 4;++j)
            {
                for (int k = 0;k < 4;++k)
                {
                    if (check({ i,j,k }))
                    {
                        cout << a[0] << s[i] << a[1] << s[j] << a[2] << s[k] << a[3] << endl;
                        return 0;
                    }
                }
            }
        }
    } while (next_permutation(a.begin(), a.end()));
    return 0;
}